Efficient posterior exploration of a high-dimensional groundwater model from two-stage Markov chain Monte Carlo simulation and polynomial chaos expansion

نویسندگان

  • Eric Laloy
  • Bart Rogiers
  • Jasper A. Vrugt
  • Dirk Mallants
  • Diederik Jacques
چکیده

[1] This study reports on two strategies for accelerating posterior inference of a highly parameterized and CPU-demanding groundwater flow model. Our method builds on previous stochastic collocation approaches, e.g., Marzouk and Xiu (2009) and Marzouk and Najm (2009), and uses generalized polynomial chaos (gPC) theory and dimensionality reduction to emulate the output of a large-scale groundwater flow model. The resulting surrogate model is CPU efficient and serves to explore the posterior distribution at a much lower computational cost using two-stage MCMC simulation. The case study reported in this paper demonstrates a two to five times speed-up in sampling efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Stochastic algorithm to solve multiple dimensional Fredholm integral equations of the second kind

In the present work‎, ‎a new stochastic algorithm is proposed to solve multiple dimensional Fredholm integral equations of the second kind‎. ‎The solution of the‎ integral equation is described by the Neumann series expansion‎. ‎Each term of this expansion can be considered as an expectation which is approximated by a continuous Markov chain Monte Carlo method‎. ‎An algorithm is proposed to sim...

متن کامل

A Dynamic Bi-orthogonal Field Equation Approach for Efficient Bayesian Calibration of Large-Scale Systems

This paper proposes a novel computationally efficient dynamic bi-orthogonality based approach for calibration of a computer simulator with high dimensional parametric and model structure uncertainty. The proposed method is based on a decomposition of the solution into mean and a random field using a generic Karhunnen-Loeve expansion. The random field is represented as a convolution of separable...

متن کامل

Multi-resolution Genetic Algorithms and Markov Chain Monte Carlo

Due to modern advances in computing power, the use of increasingly complex models has become practical. One class of large models that often relies on numerical techniques for parameter estimation is multiresolution models. Unfortunately, numerical maximization and sampling techniques used to estimate parameters in such complex models often explore the parameter space slowly, resulting in unrel...

متن کامل

Dimensionality reduction and polynomial chaos acceleration of Bayesian inference in inverse problems

We consider a Bayesian approach to nonlinear inverse problems in which the unknown quantity is a spatial or temporal field, endowed with a hierarchical Gaussian process prior. Computational challenges in this construction arise from the need for repeated evaluations of the forward model (e.g., in the context of Markov chain Monte Carlo) and are compounded by high dimensionality of the posterior...

متن کامل

Generalized Poststratification and Importance Sampling for Subsampled Markov Chain Monte Carlo Estimation

Benchmark estimation is motivated by the goal of producing an approximation to a posterior distribution that is better than the empirical distribution function. This is accomplished by incorporating additional information into the construction of the approximation. We focus here on generalized poststratification, the most successful implementation of benchmark estimation in our experience. We d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013